Undecidability Results for Low Complexity Time Classes
نویسندگان
چکیده
منابع مشابه
Undecidability Results for Low Complexity Time Classes
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in Nies 12]. The method can be applied in fact to all time classes given by a time constructible function which dominates all polynomials. By a similar method, we construct an...
متن کاملUndecidability Results for Low Complexity Degree Structures
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in [7]. The method can be applied in fact to all hyper-polynomial time classes.
متن کاملUndecidability Results for Low Complexity Degree Structures Extended Abstract
We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one re-ducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in 7]. The method can be applied in fact to all hyper-polynomial time classes.
متن کاملComplexity, Decidability and Undecidability Results for Domain-Independent Planning
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is decidable and undecidable. Our results on this topic solve an open problem posed by Chapman [5], and clear up some difficulties with his undecidability theorems. For those cases where planning is decid...
متن کاملComplexity Results for Classes of Quantificational Formulas
We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate calculus obeying certain syntactic restrictions. For example, for the monadic predicate calculus and the Code1 or 3 ’ .. WV3 1.. 3 prefix class we obtain lower and upper nondeterministic time bounds of the form c”/“‘~“. The lower bounds are established by using acceptan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2000
ISSN: 0022-0000
DOI: 10.1006/jcss.1999.1678